منابع مشابه
Totally Symmetric Functions are Reconstructible from Identification Minors
We formulate a reconstruction problem for functions of several arguments: Is a function of several arguments uniquely determined, up to equivalence, by its identification minors? We establish some positive and negative results on this reconstruction problem. In particular, we show that totally symmetric functions (of sufficiently large arity) are reconstructible.
متن کاملGraphs Without Large Complete Minors Are Quasi-Random
We answer a question of S ´ os by showing that, if a graph G of order n and density p has no complete minor larger than would be found in a random graph G(n, p), then G is quasi-random, provided either p > 0.45631. .. or κ(G) n(log log log n)/(log log n), where 0.45631. .. is an explicit constant. The results proved can also be used to fill the gaps in an argument of Thomason, describing the ex...
متن کاملLogarithmically small minors and topological minors
For every integer t there is a smallest real number c(t) such that any graph with average degree at least c(t) must contain a Kt-minor (proved by Mader). Improving on results of Shapira and Sudakov, we prove the conjecture of Fiorini, Joret, Theis and Wood that any graph with n vertices and average degree at least c(t) + ε must contain a Kt-minor consisting of at most C(ε, t) logn vertices. Mad...
متن کاملMSO satisfaction is FPT on
There is a computable function f such that the problem of deciding, given a word w and an MSO sentence φ whether, S w |= φ can be decided in time O(f (l)n) where l is the length of φ and n is the length of w.
متن کاملTournament minors
We say a digraph G is a minor of a digraph H if G can be obtained from a subdigraph of H by repeatedly contracting a strongly-connected subdigraph to a vertex. Here, we show the class of all tournaments is a well-quasi-order under minor containment.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2016
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-016-0220-1